Type introduction for equational rewriting

Dependency Pairs for Equational Rewriting

Equational Term Graph Rewriting

We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Speciically, a homomorphism is a functional bisimulation. We prove that the bisimilarity class of a term graph, partially ordered by functional bisimulation, is a complete latti...

Term-Rewriting Implementation of Equational Logic Programming

1987 ABSTRACT In 1975 I started a small project to explore the consequences of implementing equational programs with no semantic compromises. Latest results include a compiler that executes exactly the logical consequences of an equa-tional program, with run-time speed comparable to compiled Franz LISP. This paper describes the accomplishments of the project very brieey, concentrating on shortc...

Equational Reasoning and Term Rewriting Systems

A Tree Automata Theory for Uni cation Modulo Equational Rewriting

An extension of tree automata framework, called equational tree automata, is presented. This theory is useful to deal with uni cation modulo equational rewriting. In the manuscript, we demonstrate how equational tree automata can be applied to uni cation problems. 1 Equational Tree Languages Uni cation modulo equational theory is a central topic in automated reasoning. Tree automata are the pow...